Determinacy for infinite games with more than two players with preferences
نویسندگان
چکیده
We discuss infinite zero-sum perfect-information games with more than two players. They are not determined in the traditional sense, but as soon as you fix a preference function for the players and assume common knowledge of rationality and this preference function among the players, you get determinacy for open and closed payoff sets. 2000 AMS Mathematics Subject Classification. 91A06 91A10 03B99 03E99.
منابع مشابه
Determinacy in Stochastic Games with Unbounded Payoff Functions
We consider infinite-state turn-based stochastic games of two players, and ^, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded, the determinacy of such games cannot be deduced directly from Martin’s determinacy result for Blackwell games. Nevertheless, we show that these games are determined bot...
متن کاملDeterminacy and optimal strategies in infinite-state stochastic reachability games
We consider perfect-information reachability stochastic games for 2 players on infinite graphs. We identify a subclass of such games, and prove two interesting properties of it: first, Player Max always has optimal strategies in games from this subclass, and second, these games are strongly determined. The subclass is defined by the property that the set of all values can only have one accumula...
متن کاملA pr 1 99 6 Blackwell Games 1 Blackwell Games
Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves and are then informed of each other’s moves. Payoff is determined by a Borel measurable function f on the set of possible resulting sequences of moves. A standard result in Game Theory is that finite games of this type are determined. Blackwell proved that infinite games are determined, ...
متن کاملPositional Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two players has a positional winning strategy. The theory of such games is well studied for winning c...
متن کاملPostinal Determinacy of Games with Infinitely Many Priorities
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is positionally determined if, from each position, one of the two players has a positional winning strategy. The theory of such games is well studied for winning c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003